Dr Penny Munn
نویسندگان
چکیده
منابع مشابه
2003 Penny sort
The goal of the PennySort benchmark is to reflect the progress done by technology, in particular, evolvement of I/O OS subsystems and file systems. This benchmark measures what data volume can be sorted for “one penny” on a system, which cost is distributed over three years. This work decribes how to build a cost-effective system for this competition, using our high-performance external algorit...
متن کاملPenny: Secure, Decentralized Data Management
Structured, peer-to-peer (P2P) networks scalably support efficient data-retrieval operations over large data sets without resorting to centralized servers that may be vulnerable to attack or failure. However, data confidentiality policies, such as data ownership privacy, are difficult to enforce reliably in these networks. This paper presents Penny, a structured P2P network that efficiently sup...
متن کاملWhen the penny drops
To cite: Parkinson MH, Patel R, Davagnanam I, et al. Pract Neurol 2014;14: 409–414. A 26-year-old woman presented after developing slurred speech and drooling overnight. She had a 6-month history of tiredness and poor concentration, and episodes of loss of consciousness accompanied by paraesthesia of her hands, feet and mouth. Occasionally, one arm would ‘hang in a strange way’. Her mother repo...
متن کاملOn wrinkled penny-shaped cracks
A nominally at penny-shaped crack is subjected to a static loading. A perturbation method is developed for calculating the stress-intensity factors, based on an asymptotic analysis of the governing hypersingular boundary integral equation for the crack-opening displacement. Comparisons with known exact solutions for an inclined at elliptical crack and for a crack in the shape of a spherical cap...
متن کاملSorting 39GB for a Penny
I sorted 39GB for a penny using a cheap general purpose processor and two disk drives, running each drive at about 28MB/s sustained. No special-purpose processors, such as GPUs, were employed for the in-memory part of the sort. The sort is a general-purpose sort that can compare records of arbitrary size, and does not rely on the keys being uniformly randomly distributed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Early Years Education
سال: 2011
ISSN: 0966-9760,1469-8463
DOI: 10.1080/09669760.2011.630832